Phi-Divergence Constrained Ambiguous Stochastic Programs for Data-Driven Optimization
نویسندگان
چکیده
This paper investigates the use of φ-divergences in ambiguous (or distributionally robust) two-stage stochastic programs. Classical stochastic programming assumes the distribution of uncertain parameters are known. However, the true distribution is unknown in many applications. Especially in cases where there is little data or not much trust in the data, an ambiguity set of distributions can be used to hedge against the distributional uncertainty. φ-divergences (e.g., Kullback-Leibler divergence, χ distance, etc.) provide a natural way to create an ambiguity set of distributions that are centered around a nominal distribution. The nominal distribution can be obtained by using observed data, expert opinions, simulations, and so forth. In this paper, we present a classification of φ-divergences to elucidate their use for models with different properties and sources of data. We illustrate our classification on φ-divergences that result in common risk optimization models. A condition for assessing the value of collecting additional data is derived, and we demonstrate that the φ-divergence-based ambiguous program behaves essentially the same as the associated non-ambiguous stochastic program as more data is collected. We present a decomposition-based solution algorithm to solve the resulting model. Finally, we demonstrate the behavior of φ-divergences in an optimization setting for a numerical example.
منابع مشابه
Kullback-Leibler Divergence Constrained Distributionally Robust Optimization
In this paper we study distributionally robust optimization (DRO) problems where the ambiguity set of the probability distribution is defined by the Kullback-Leibler (KL) divergence. We consider DRO problems where the ambiguity is in the objective function, which takes a form of an expectation, and show that the resulted minimax DRO problems can be formulated as a one-layer convex minimization ...
متن کاملData-driven chance constrained stochastic program
Chance constrained programming is an effective and convenient approach to control riskin decision making under uncertainty. However, due to unknown probability distributions ofrandom parameters, the solution obtained from a chance constrained optimization problem canbe biased. In addition, instead of knowing the true distributions of random parameters, inpractice, only a series ...
متن کاملData-Driven Stochastic Programming Using Phi-Divergences
Most of classical stochastic programming assumes that the distribution of uncertain parameters are known, and this distribution is an input to the model. In many applications, however, the true distribution is unknown. An ambiguity set of distributions can be used in these cases to hedge against the distributional uncertainty. Phi-divergences (Kullback–Leibler divergence, χ-distance, etc.) prov...
متن کاملAmbiguous Chance Constrained Programs: Algorithms and Applications
Ambiguous Chance Constrained Programs: Algorithms and Applications Emre Erdoğan Chance constrained problems are optimization problems where one or more constraints ensure that the probability of one or more events occurring is less than a prescribed threshold. Although it is typically assumed that the distribution defining the chance constraints are known perfectly; in practice this assumption ...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کامل